Synchronized sweep algorithms for scalable scheduling constraints
نویسندگان
چکیده
منابع مشابه
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by iteratively sweeping across a mesh from multiple directions. Each sweep involves solving the operator locally at each cell. However, each direction induces a partial order in which this computation can proceed. On a dis...
متن کاملA Scalable Sweep Algorithm for the cumulative and bin-packing constraints
This paper presents a new sweep based algorithm for the cumulative constraint that combines filtering with a greedy mode. The algorithm has a worst case complexity of O(n log n) in the context of cumulative and O(n log n) in the context of bin-packing, where n is the number of tasks (items). It can handle up to 256000 tasks (items) in less than 15 minutes within a single cumulative constraint.
متن کاملA Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint
This paper presents a sweep based algorithm for the kdimensional cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks and k resources, this algorithm has a worst-case time complexity of O(kn) but scales well in practice. In greedy assignment mode, it handles up to 1 million tasks with 64 resources in one single constraint in SICStus. In ...
متن کاملStatic and Dynamic Scheduling Algorithms for Scalable Web Server Farm
Multiprocessor-based servers are often used for building popular Web sites which have to guarantee an acceptable Quality of Web Service. In common multi-node systems, namely Web server farms, a Web switch (say, Dispatcher) routes client requests among the server nodes. This architecture resembles a traditional cluster in which a global scheduler dispatches parallel applications among the server...
متن کاملApproximation algorithms for scheduling parallel machines with capacity constraints ∗
In this paper, we consider the classical scheduling problem on parallel machines with capacity constraints. We are given m identical machines, where each machine k can process up to ck jobs. The goal is to assign the n ≤ ∑m k=1 ck independent jobs on the machines subject to the capacity constraints such that the makespan is minimized. This problem is a generalization of the c-partition problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2014
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-014-9172-8